Optimized Schoolbook Polynomial Multiplication for Compact Lattice-Based Cryptography on FPGA
نویسندگان
چکیده
منابع مشابه
An Efficient LUT Design on FPGA for Memory-Based Multiplication
An efficient Lookup Table (LUT) design for memory-based multiplier is proposed. This multiplier can be preferred in DSP computation where one of the inputs, which is filter coefficient to the multiplier, is fixed. In this design, all possible product terms of input multiplicand with the fixed coefficient are stored directly in memory. In contrast to an earlier proposition Odd Multiple Storage ...
متن کاملAn Optimized Montgomery Modular Multiplication Algorithm for Cryptography
Montgomery modular multiplication is one of the fundamental operations used in cryptographic algorithms, such as RSA and Elliptic Curve Cryptosystems. The previous Montgomery multipliers perform a single Montgomery multiplication in approximately 2n clock cycles and it requires more number of addition stages for large word length additions, where n is the size of operands in bits. In this paper...
متن کاملAn Optimized Montgomery Modular Multiplication Algorithm for Cryptography
Montgomery modular multiplication is one of the fundamental operations used in cryptographicalgorithms, such as RSA andElliptic Curve Cryptosystem. The previous Montgomery multipliers perform a single Montgomery multiplication in approximately 2n clock cycles and it requires more numberof addition stages for large word length addition, where nis the size of of operandsoperands inbits. Inthis pa...
متن کاملFPGA Architecture for the Implementation Of Polynomial Matrix Multiplication
In this paper, the Polynomial Matrix Multiplication (PMM) of polynomial vectors and/or polynomial matrices have been introduced. This method provides an improvement of the fast convolution technique to multiple inputs multiple output systems (MIMO). It is devoted to the hardware implementation of PMM. The hardware implementation of this method is achieved via partly systolic, field programmable...
متن کاملImproved Three-Way Split Approach for Binary Polynomial Multiplication Based on Optimized Reconstruction
At Crypto 2009 [1], Bernstein initiated an optimization of Karatsuba formula for binary polynomial multiplication by reorganizing the computations in the reconstruction part of two recursions of the formula. This approach was generalized in [10] to an arbitrary number of recursions resulting in the best known bit parallel multiplier based on Karatsuba formula. In this paper we extend this appro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Very Large Scale Integration (VLSI) Systems
سال: 2019
ISSN: 1063-8210,1557-9999
DOI: 10.1109/tvlsi.2019.2922999